Correction to: Outer 1-Planar Graphs
نویسندگان
چکیده
A Correction to this paper has been published: 10.1007/s00453-015-0002-1
منابع مشابه
Recognizing Outer 1-Planar Graphs in Linear Time
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time and specialize 1-planar graphs, whose recognition is NP-hard. Our main result is a linear-time algorithm that first tests whether a graph G is o1p, and then computes an...
متن کاملDrawing Outer 1-planar Graphs with Few Slopes
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees. We show that an outer 1-planar graph G of bounded degree ∆ admits an outer 1-planar straight-line drawing that uses O(∆) different slopes, which gen...
متن کاملThe edge chromatic number of outer-1-planar graphs
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs.
متن کاملObstruction Sets for Outer-Projective-Planar Graphs
A graph G is outer projective planar if it can be embedded in the projective plane so that every vertex appears on the boundary of a single face We exhibit obstruction sets for outer projective planar graphs with respect to the subdivision minor and Y orderings Equivalently we nd the minimal non outer projective planar graphs under these orderings
متن کاملRecursive sum-product algorithm for generalized outer-planar graphs
Article history: Received 26 June 2011 Received in revised form 1 March 2012 Accepted 2 March 2012 Available online 6 March 2012 Communicated by J. Torán
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: ['1432-0541', '0178-4617']
DOI: https://doi.org/10.1007/s00453-021-00874-z